RSA problem

Results: 73



#Item
31RSA / Dining cryptographers problem / Cryptographic hash function / Hash function / XTR / Email / Index of cryptography articles / Cryptography / Public-key cryptography / Electronic commerce

CS255: Cryptography and Computer Security Winter 1998 Final Exam

Add to Reading List

Source URL: crypto.stanford.edu

Language: English - Date: 2000-03-02 16:04:37
32RSA / Dining cryptographers problem / Cryptographic hash function / Hash function / XTR / Email / Index of cryptography articles / Cryptography / Public-key cryptography / Electronic commerce

CS255: Cryptography and Computer Security Winter 1998 Final Exam

Add to Reading List

Source URL: crypto.stanford.edu

Language: English - Date: 2002-03-13 15:29:31
33Cryptographic protocols / Electronic commerce / Computational hardness assumptions / RSA / Diffie–Hellman key exchange / Diffie–Hellman problem / Discrete logarithm / Schmidt–Samoa cryptosystem / Paillier cryptosystem / Cryptography / Public-key cryptography / Finite fields

CS255: Cryptography and Computer Security Winter 2001 Final Exam Instructions

Add to Reading List

Source URL: crypto.stanford.edu

Language: English - Date: 2002-05-13 22:32:41
34Cryptographic protocols / Electronic commerce / Computational hardness assumptions / RSA / Diffie–Hellman key exchange / Diffie–Hellman problem / Discrete logarithm / Schmidt–Samoa cryptosystem / Paillier cryptosystem / Cryptography / Public-key cryptography / Finite fields

CS255: Cryptography and Computer Security Winter 2001 Final Exam Instructions

Add to Reading List

Source URL: crypto.stanford.edu

Language: English - Date: 2003-01-05 20:38:47
35Cryptographic protocols / Electronic commerce / Computational hardness assumptions / RSA / Diffie–Hellman key exchange / Diffie–Hellman problem / Discrete logarithm / Schmidt–Samoa cryptosystem / Paillier cryptosystem / Cryptography / Public-key cryptography / Finite fields

CS255: Cryptography and Computer Security Winter 2001 Final Exam Instructions

Add to Reading List

Source URL: crypto.stanford.edu

Language: English - Date: 2004-01-05 17:05:04
36Advantage / Semantic security / RSA / Ciphertext indistinguishability / Keystream / Cryptography / Electronic commerce / Public-key cryptography

CS255: Introduction to Cryptography Winter 2015 Assignment #2: Solutions Problem 1. (a) Suppose we can find two message/hash pairs hM1 , h(M1 )i and hM2 , h(M2 )i such that

Add to Reading List

Source URL: crypto.stanford.edu

Language: English - Date: 2015-03-01 19:29:53
37RSA problem / RSA / Secure multi-party computation / Ueli Maurer / Key / Computational complexity theory / Lattice problem / Cryptography / Public-key cryptography / Key management

ZISC Annual Report[removed] [removed]ZISC Annual Report[removed]

Add to Reading List

Source URL: www.zisc.ethz.ch

Language: English - Date: 2015-02-14 00:57:50
38Digital signature / Diffie–Hellman problem / Signcryption / Group signature / Blind signature / ID-based encryption / RSA / Pairing / Diffie–Hellman key exchange / Cryptography / BLS / Decisional Diffie–Hellman assumption

Pairing-Based Cryptographic Protocols : A Survey Ratna Dutta, Rana Barua and Palash Sarkar Cryptology Research Group Stat-Math and Applied Statistics Unit 203, B. T. Road, Kolkata India[removed]

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2004-06-24 08:19:14
39Finite fields / Electronic commerce / Paillier cryptosystem / Okamoto–Uchiyama cryptosystem / Goldwasser–Micali cryptosystem / XTR / ElGamal encryption / Diffie–Hellman problem / RSA / Cryptography / Public-key cryptography / Computational hardness assumptions

A Simple Public-Key Cryptosystem with a Double Trapdoor Decryption Mechanism and its Applications Emmanuel Bresson1 , Dario Catalano2 , and David Pointcheval2 1

Add to Reading List

Source URL: www.iacr.org

Language: English - Date: 2008-09-15 00:54:54
40Number theory / Quadratic sieve / General number field sieve / MapReduce / Integer factorization / Quadratic residue / Factor base / Factorization / RSA / Integer factorization algorithms / Cryptography / Mathematics

MAPREDUCE FOR INTEGER FACTORIZATION arXiv:1001.0421v1 [cs.DC] 4 Jan 2010 JAVIER TORDABLE Abstract. Integer factorization is a very hard computational problem. Currently no efficient algorithm for integer factorization i

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2010-01-03 19:17:14
UPDATE